Group Session Key Exchange Multilayer Perceptron Based Simulated Annealing

In this paper, a group session Key Exchange multilayer Perceptron based Simulated Annealing guided Automata and Comparison based Metamorphosed encryption technique (GSMLPSA) has been proposed in wireless communication of data/information. Both sender and receiver uses identical multilayer perceptron and depending on the final output of the both side multilayer perceptron, weights vector of hidden layer get tuned in both ends. As a results both perceptrons generates identical weight vectors which is consider as an one time session key. In GSMLPSA technique plain text is encrypted using metamorphosed code table for producing level 1 encrypted text. Then comparison based technique is used to further encerypt the level 1 encrypted text and produce level 2 encrypted text. Simulated Annealing based keystream is xored with the leve2 encrypted text and form a level 3 encrypted text. Finally level 3 encrypted text is xored with the MLP based session key and get transmitted to the receiver. GSMLPSA technique uses two keys for encryption purpose. SA based key get further encrypted using Automata based technique and finally xored with MLP based session key and transmitted to the receiver. This technique ensures that if intruders intercept the key of the keystream then also values of the key not be known to the intruders because of the automata based encoding. Receiver will perform same operation in reverse order to get the plain text back. Two parties can swap over a common key using synchronization between their own multilayer perceptrons. But the problem crop up when group of N parties desire to swap over a key. Since in this case each communicating party has to synchronize with other for swapping over the key. So, if there are N parties then total number of synchronizations needed before swapping over the actual key is O(N). GSMLPSA scheme offers a novel technique in which complete binary tree structure is follows for key swapping over. Using proposed algorithm a set of N parties can be able to share a common key with only O(log2 N) synchronization. Parametric tests have been done and results are compared with some existing classical techniques, which show comparable results for the proposed technique.